An improved FPT algorithm for the flip distance problem

Given a set P of points in the Euclidean plane and two triangulations P, flip distance between these is minimum number flips required to transform one triangulation into other. The Parameterized Flip Distance problem decide if given equal integer k. previous best FPT algorithm runs time O?(k?ck) (c?2×1411), where each step has fourteen possible choices, length action sequence bounded by 11k. By analyzing underlying properties sequence, our only five choices. Based on an auxiliary graph G, we prove that for 2|G|. As result, present running O?(k?32k).